Hamiltonian Properties of Generalized Halin Graphs
نویسندگان
چکیده
A Halin graph is a graph H = T ∪ C , where T is a tree with no vertex of degree two, and C is a cycle connecting the end-vertices of T in the cyclic order determined by a plane embedding of T. In this paper, we define classes of generalized Halin graphs, called k-Halin graphs, and investigate their Hamiltonian properties.
منابع مشابه
A note on Hamiltonian cycles in generalized Halin graphs
We show that every 2-connected (2)-Halin graph is Hamiltonian.
متن کاملLovász-Plummer conjecture on Halin graphs
A Halin graph, defined by Halin [3], is a plane graph H = T ∪ C such that T is a spanning tree of H with no vertices of degree 2 where |T | ≥ 4 and C is a cycle whose vertex set is the set of leaves of T . In his work, as an example of a class of edge-minimal 3-connected plane graphs, Halin constructed this family of plane graphs, which have many interesting properties. Lovász and Plummer [5] n...
متن کاملHamiltonicity of Cubic 3-Connected k-Halin Graphs
We investigate here how far we can extend the notion of a Halin graph such that hamiltonicity is preserved. Let H = T ∪ C be a Halin graph, T being a tree and C the outer cycle. A k-Halin graph G can be obtained from H by adding edges while keeping planarity, joining vertices of H − C, such that G − C has at most k cycles. We prove that, in the class of cubic 3-connected graphs, all 14-Halin gr...
متن کاملHamiltonian properties of generalized pyramids
We investigate here the hamiltonicity and traceability of a class of polytopes generalizing pyramids, prisms, and polytopes with Halin 1-skeleta.
متن کاملPlane Triangulations Without a Spanning Halin Subgraph II
A Halin graph is a plane graph constructed from a planar drawing of a tree by connecting all leaves of the tree with a cycle which passes around the boundary of the graph. The tree must have four or more vertices and no vertices of degree two. Halin graphs have many nice properties such as being Hamiltonian and remain Hamiltonian after any single vertex deletion. In 1975, Lovász and Plummer con...
متن کامل